Base Logics in Argumentation

نویسنده

  • Anthony Hunter
چکیده

There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arguments. A common assumption for logic-based argumentation is that an argument is a pair 〈Φ, α〉 where Φ is a minimal subset of the knowledgebase such that Φ is consistent and Φ entails the claim α. We call the logic used for consistency and entailment, the base logic. Different base logics provide different definitions for consistency and entailment and hence give us different options for argumentation. This paper discusses some of the commonly used base logics in logic-based argumentation, and considers various criteria that can be used to identify commonalities and differences between them.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Argumentation-based Paraconsistent Logics

Argumentation is an alternative approach for reasoning with inconsistent information. Starting from a knowledge base (a set of premises) encoded in a logical language, an argumentation-based logic defines arguments and attacks between them using the consequence operator associated with the language, then uses a semantics for evaluating the arguments. The plausible conclusions to be drawn from t...

متن کامل

Argumentation-based Ranking Logics

This paper proposes a novel family of argumentation-based logics for handling inconsistency. Starting with a base logic, it builds arguments and attack relations between them. The novelty of the approach lies in the fact that arguments are evaluated using a ranking semantics which rank-orders arguments from the most acceptable to the least acceptable ones. Naturally, a second novelty is that th...

متن کامل

Logical limits of abstract argumentation frameworks

Dung’s argumentation framework takes as input two abstract entities: a set of arguments and a binary relation encoding attacks between these arguments. It returns acceptable sets of arguments, called extensions, wrt a given semantics. While the abstract nature of this setting is seen as a great advantage, it induces a big gap with the application that it is used to. This raises some questions a...

متن کامل

Relating Protocols For Dynamic Dispute With Logics For Defeasible Argumentation

This article investigates to what extent protocols for dynamic disputes, i.e., disputes in which the information base can vary at different stages, can be justified in terms of logics for defeasible argumentation. First a general framework is formulated for dialectical proof theories for such logics. Then this framework is adapted to serve as a framework for protocols for dynamic disputes, afte...

متن کامل

Approximate Arguments for Efficiency in Logical Argumentation

There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arguments. A common assumption for logic-based argumentation is that an argument is a pair 〈Φ, α〉 where Φ is minimal subset of the knowledgebase such that Φ is consistent and Φ entails the claim α. Different logics are b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010